Ela Algebraic Connectivity
نویسنده
چکیده
Let G be a weighted graph. Let v be a vertex of G and let Gω denote the graph obtained by adding a vertex u and an edge {v, u} with weight ω to G. Then the algebraic connectivity μ(Gω) of G v ω is a nondecreasing function of ω and is bounded by the algebraic connectivity μ(G) of G. The question of when lim ω→∞ v ω) is equal to μ(G) is considered and answered in the case that G is a tree.
منابع مشابه
Ela the Minimum Algebraic Connectivity of Caterpillar Unicyclic Graphs
A caterpillar unicyclic graph is a unicyclic graph in which the removal of all pendant vertices makes it a cycle. In this paper, the unique caterpillar unicyclic graph with minimum algebraic connectivity among all caterpillar unicyclic graphs is determined.
متن کاملEla on the Log-concavity of Laplacian Characteristic Polynomials of Graphs∗
Let G be a graph and L(G) be the Laplacian matrix of G. In this article, we first point out that the sequence of the moduli of Laplacian coefficients of G is log-concave and hence unimodal. Using this fact, we provide an upper bound for the partial sums of the Laplacian eigenvalues of G, based on coefficients of its Laplacian characteristic polynomial. We then obtain some lower bounds on the al...
متن کاملEla on 3-colored Digraphs with Exactly One Nonsingular Cycle
The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...
متن کاملEla Extremal Algebraic Connectivities of Certain Caterpillar Classes and Symmetric Caterpillars∗
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] such that p1 ≥ 1, p2 ≥ 1, ..., pd−1 ≥ 1. Let C (p) be the caterpillar obtained from the stars Sp1 , Sp2 , ..., Spd−1 and the path Pd−1 by identifying the root of Spi with the i...
متن کاملEla a New Upper Bound for the Eigenvalues of the Continuous Algebraic Riccati Equation
By using majorization inequalities, we propose a new upper bound for summations of eigenvalues (including the trace) of the solution of the continuous algebraic Riccati equation. The bound extends some of the previous results under certain conditions. Finally, we give a numerical example to illustrate the effectiveness of our results.
متن کامل